#include <bits/stdc++.h>    
using namespace std;
const int N = 1e5+5;
int r[N];
bool v[N];
int R[N],cnt[N];
int n,m;
bool cmp(int u,int v){return u>v;}
int main() {
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> r[i];
    }
    sort(r+1,r+n+1);
    for(int i = 1;i <= n;i++){
        if(r[i]!=r[i-1])R[++m]=r[i];
        cnt[m]++;
    }
    for(int i = 1;i <= m;i++){
        cnt[i]=cnt[i]+max(0,cnt[i-1]-cnt[i]);
    }
    cout << cnt[m] << endl;
    return 0;
}